Appearance
Now marginally more spooky!
We are given intercept.txt and problem.sage, which are some data the challenge script.
Description
This implements an elliptic curve key distribution algorithm, and the curve has quite a interesting property, E_order = N. This allows us to use the smart attack.
Smart attack
The main idea about this is to lift the curve from mod N to mod N^2, and ECC multiplication becomes an additive group. More detail is in the paper about smart attack here
Derivation of Hensel lifting
Here is just a short derivation of Hensel lifting for this particular case.
Let where is given by . Let's say we found a root of , then we can find a root, with and .
Since
Since we just need to find , we get and .
The division of is well defined since .